Join Query Optimization in Parallel Database Systems

In this paper we present a new framework for studying parallel query optimization. We first note that scheduling and optimization must go together in a parallel environment. We introduce the concept of response time envelopes which integrates scheduling and optimization. We show that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity as the traditional sequential query optimization algorithms and produce provably optimal or near optimal join plans.